On the Storage Cost of Private Information Retrieval
نویسندگان
چکیده
منابع مشابه
Lower-Cost ∈-Private Information Retrieval
Private Information Retrieval (PIR), despite being well studied, is computationally costly and arduous to scale. We explore lower-cost relaxations of information-theoretic PIR, based on dummy queries, sparse vectors, and compositions with an anonymity system. We prove the security of each scheme using a flexible differentially private definition for private queries that can capture notions of i...
متن کاملLower-Cost epsilon-Private Information Retrieval
Private Information Retrieval (PIR), despite being well studied, is computationally costly and arduous to scale. We explore lower-cost relaxations of information-theoretic PIR, based on dummy queries, sparse vectors, and compositions with an anonymity system. We prove the security of each scheme using a flexible differentially private definition for private queries that can capture notions of i...
متن کاملOn the Practicality of Private Information Retrieval
We explore the limits of single-server computational private information retrieval (PIR) for the purpose of preserving client access patterns leakage. We show that deployment of non-trivial single server PIR protocols on real hardware of the recent past would have been orders of magnitude less time-efficient than trivially transferring the entire database. We stress that these results are beyon...
متن کاملMultiround Private Information Retrieval: Capacity and Storage Overhead
The capacity has recently been characterized for the private information retrieval (PIR) problem as well as several of its variants. In every case it is assumed that all the queries are generated by the user simultaneously. Here we consider multiround PIR, where the queries in each round are allowed to depend on the answers received in previous rounds. We show that the capacity of multiround PI...
متن کاملEvaluating Private Information Retrieval on the Cloud
The goal of Private Information Retrieval (PIR) is for a client to query a database in such a way that no one, including the database operator, can determine any information about the desired database record. Many PIR schemes have been developed, but are generally not deemed fast enough for client needs in today’s fast-paced world or do not scale well to large databases. We implement a parallel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2020.3015818